Contracts and coordination: Supply chains with uncertain demand and supply

Considering a supply chain with a supplier subject to yield uncertainty selling to a retailer facing stochastic demand, we find that commonly studied classical coordination contracts fail to coordinate both the supplier's production and the retailer's procurement decisions and achieve efficient performance. First, we study the vendor managed inventory (VMI) partnership. We find that a consignment VMI partnership coupled with a production cost subsidy achieves perfect coordination and a win‐win outcome; it is simple to implement and arbitrarily allocates total channel profit. The production cost subsidy optimally chosen through Nash bargaining analysis depends on the bargaining power of the supplier and the retailer. Further, motivated by the practice that sometimes the retailer and the supplier can arrange a “late order,” we also analyze the behavior of an advance‐purchase discount (APD) contract. We find that an APD with a revenue sharing contract can efficiently coordinate the supply chain as well as achieve flexible profit allocation. Finally, we explore which coordination contract works better for the supplier vs. the retailer. It is interesting to observe that Nash bargaining solutions for the two coordination contracts are equivalent. We further provide recommendations on the applications of these contracts. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 305–319, 2016     

建立中国式辩诉交易制度的构想

美国的辩诉交易制度具有重要的理论价值和现实意义。有必要借鉴国外辩诉交易制度的合理因素，建立中国式的辩诉交易制度。建立中国式的辩诉交易制度，应对其适用条件、适用案件的范围及适用程序做出明确规定。     

基于MSA的高阶调制信号比特度量算法的研究

最小和算法(MSA)折中了译码性能和运算复杂度两个方面,是低密度奇偶校验码(LDPC码)硬件实现最常用的译码算法。比特后验概率对数似然比(LLR)是LDPC码MSA译码的关键参数,现有的高阶调制信号比特后验概率LLR计算方法及简化算法都需要估计噪声方差,估计值影响译码性能。论文从分析M阶无记忆二维调制信号比特后验概率LLR通用的计算方法入手,研究了适用于MSA译码的高阶调制信号比特后验概率LLR简化算法,该算法无需估计噪声方差,进一步降低了运算量和实现复杂度。     

随舰备件需求分析中维修策略问题

分析了面向任务保障性工程理论指导下的舰船随舰备件配置问题,就最大、最小两种维修策略下随舰备件配置问题进行了研究,给出了面向任务的随舰备件需求分析仿真模型框架,结合算倒,研究了最大维修策略与最小维修策略的适用时机:在任务确定且任务结构函数明确条件下,应采用最小维修策略;否则采用最大维修策略.     

The practice of strategy: South African defence in stasis

The article concerns the strategy development processes of the South African Department of Defence in South Africa. It intends to identify the probable causes of the observed failure of the South African National Defence Force to develop appropriate departmental policy and military strategy. Military strategy comprises force development, force employment, force deployment and the coordination of these elements in pursuit of national, grand-strategic objectives. (See Dennis M. Drew and Donald M. Snow, Making Twenty-first Century Strategy: An Introduction to Modern National Security Processes and Problems Montgomery, AL: Air University Press, Maxwell Air Force Base, November 2006, 103). Of these four constructs, the article concerns itself only with the first two. The article analyses two complementary approaches to strategy formation: a resource-driven, inside-out model and an interests-driven, outside-in method. The article concludes that the Department is preoccupied with the inside-out method to the lasting detriment of the declared strategic intent of the defence policy.     

Adjacency‐based local top‐down search method for finding maximal efficient faces in multiple objective linear programming

It is well‐known that the efficient set of a multiobjective linear programming (MOLP) problem can be represented as a union of the maximal efficient faces of the feasible region. In this paper, we propose a method for finding all maximal efficient faces for an MOLP. The new method is based on a condition that all efficient vertices (short for the efficient extreme points and rays) for the MOLP have been found and it relies on the adjacency, affine independence and convexity results of efficient sets. The method uses a local top‐down search strategy to determine maximal efficient faces incident to every efficient vertex for finding maximal efficient faces of an MOLP problem. To our knowledge, the proposed method is the first top‐down search method that uses the adjacency property of the efficient set to find all maximal efficient faces. We discuss this and other advantages and disadvantages of the algorithm. We also discuss some computational experience we have had with our computer code for implementing the algorithm. This computational experience involved solving several MOLP problems with the code.     

基于优先权的分布式网络设备智能轮询策略研究

针对大型网络其地域分布广,监测对象较多,监测周期过长,实时性较差且管理流量负载较大等问题,提出一种分布式网络设备智能轮询策略。在域内,针对轮询周期调整问题,通过构造体现管理者意志的评判矩阵和求解反映数据特征的DFT(离散傅立叶变换)确定轮询优先级和轮询周期取值范围,提出了基于变化率的轮询周期调整算法;在域间,通过触发和查询实现对特殊事件的采集。最后进行了仿真,表明该策略能够在减轻网络负载的同时,准确刻画网络的状态。     

关于Chidume结果的推广

在一致光滑的Banach空间,证明了满足不等式‖Tx≤C ‖x‖的一类非线性强增生算子的Mann迭代序列强收敛于Tx=f的唯一解。     

带混合误差的Ishikawa迭代格式

将Ishikawa型迭代格式的收敛性问题推广到带混合误差的Ishikawa型迭代格式的情形 ,同时所用的证明方法和技巧有所改进     

Optimal control of an M/G/1 queue with impatient priority customers

An optimal operating policy is characterized for the infinite‐horizon average‐cost case of a single server queueing control problem. The server may be turned on at arrival epochs or off at departure epochs. Two classes of customers, each of them arriving according to an independent Poisson processes, are considered. An arriving 1‐customer enters the system if the server is turned on upon his arrival, or if the server is on and idle. In the former case, the 1‐customer is selected for service ahead of those customers waiting in the system; otherwise he leaves the system immediately. 2‐Customers remain in the system until they complete their service requirements. Under a linear cost structure, this paper shows that a stationary optimal policy exists such that either (1) leaves the server on at all times, or (2) turns the server off when the system is empty. In the latter case, we show that the stationary optimal policy is a threshold strategy, this feature being commonplace in most of priority queueing systems and inventory models. However, the optimal policy in our model is determined by two thresholds instead of one. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 201–209, 2001